The impact of the lambda calculus in logic and computer science
نویسنده
چکیده
One of the most important contributions of A Church to logic is his invention of the lambda calculus We present the genesis of this theory and its two major areas of application the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand Acknowledgement The following persons provided help in various ways Erik Barendsen Jon Barwise Johan van Benthem Andreas Blass Olivier Danvy Wil Dekkers Marko van Eekelen Sol Feferman Andrzej Filinski Twan Laan Jan Ku per Pierre Lescanne Hans Mooij Robert Maron Rinus Plasmeijer Randy Pollack Kristo er Rose Richard Shore Rick Statman and Simon Thompson Partial support came from the European HCM project Typed lambda calculus CHRXCT the Esprit Working Group Types and the Dutch NWO project WINST
منابع مشابه
Programming Research Group INVESTIGATIONS ON THE DUAL CALCULUS
The Dual Calculus, proposed by Wadler in 2003, is the outcome of two distinct lines of research in theoretical computer science: A. Efforts to extend the Curry-Howard isomorphism, established between simply-typed lambda calculus and intuitionistic logic, to classical logic. B. Efforts to establish the tacit conjecture that call-by-value reduction in lambda calculus is dual to call-by-name reduc...
متن کاملThe impact of the lambda calculusin logic and computer
One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand. Acknowled...
متن کاملSequent combinators: a Hilbert system for the lambda calculus
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the more widespread adoption of natural deduction systems in computer science. This suggests that Hilbert systems, with their more uniform approach to meta-variables and substitution, may be a more suitable framework than l...
متن کاملComputer Science, Logic, Informatics Education
Our aim is to discuss what, when and, how deep logic should be taught in the computer science education in connection with the so called “Bologna process”. We survey the spread of logic in the computer science education. We draw special attention to the process resulting by 1987 in a comprehensive school in the international logic research called “Computer Science Logic”. It includes the invest...
متن کاملInvestigations on the Dual Calculus
The Dual Calculus, proposed recently by Wadler, is the outcome of two distinct lines of research in theoretical computer science: A. Efforts to extend the Curry-Howard isomorphism, established between the simply-typed lambda calculus and intuitionistic logic, to classical logic. B. Efforts to establish the tacit conjecture that call-by-value reduction in lambda calculus is dual to call-by-name ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bulletin of Symbolic Logic
دوره 3 شماره
صفحات -
تاریخ انتشار 1997